SAGA 2003 : stochastic algorithms : foundations and applications (Hatfield, 22-23 September 2003)Albrecht, Andreas; Steinhöfel, Kathleen.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20103-3, VIII, 166 p, isbn 3-540-20103-3Conference Proceedings

On the decidability of self-assembly of infinite ribbonsADLEMAN, Leonard; KARI, Jarkko; KARI, Lila et al.Annual Symposium on Foundations of Computer Science. 2002, pp 530-537, isbn 0-7695-1822-2, 8 p.Conference Paper

Capturing an Evader in a Building : Computational geometry in navigation and path planningSUZUKI, Ichiro; ZYLINSKI, Pawel.IEEE robotics & automation magazine. 2008, Vol 15, Num 2, pp 16-26, issn 1070-9932, 11 p.Article

Average-case complexity of partial Boolean functionsCHASHKIN, Alexander.Lecture notes in computer science. 2003, pp 146-156, issn 0302-9743, isbn 3-540-20103-3, 11 p.Conference Paper

LT codesLUBY, Michael.Annual Symposium on Foundations of Computer Science. 2002, pp 271-280, isbn 0-7695-1822-2, 10 p.Conference Paper

New results for online page replicationFLEISCHER, Rudolf; GŁAZEK, Włodzimierz; SEIDEN, Steve et al.Theoretical computer science. 2004, Vol 324, Num 2-3, pp 219-251, issn 0304-3975, 33 p.Article

Randomized computation with cellular automataCHOPARD, Bastien; TOMASSINI, Marco.Lecture notes in computer science. 2004, pp 71-80, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Testing low-degree polynomials over prime fieldsJUTLA, Charanjit S; PATTHAK, Anindya C; RUDRA, Atri et al.Annual Symposium on Foundations of Computer Science. 2004, pp 423-432, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Better algorithms for unfair metrical task systems and applicationsFIAT, Amos; MENDEL, Manor.SIAM journal on computing (Print). 2003, Vol 32, Num 6, pp 1403-1422, issn 0097-5397, 20 p.Article

Local search for unsatisfiabilityPRESTWICH, Steven; LYNCE, Ines.Lecture notes in computer science. 2006, pp 283-296, issn 0302-9743, isbn 3-540-37206-7, 1Vol, 14 p.Conference Paper

Dynamic approximate all-pairs shortest paths in undirected graphsRODITTY, Liam; ZWICK, Uri.Annual Symposium on Foundations of Computer Science. 2004, pp 499-508, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

A Stochastic Traffic Assignment Algorithm Based on Ant Colony OptimisationD'ACIERNO, Luca; MONTELLA, Bruno; DE LUCIA, Fortuna et al.Lecture notes in computer science. 2006, pp 25-36, issn 0302-9743, isbn 3-540-38482-0, 1Vol, 12 p.Conference Paper

Randomized approximations of parameterized counting problemsMÜLLER, Moritz.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 10 p.Conference Paper

Performance characterization of decentralized algorithms for replica selection in distributed object systemsTAN, Ceryen; MILLS, Kevin.International Workshop on Software and Performance. 2005, pp 257-262, isbn 1-59593-087-6, 1Vol, 6 p.Conference Paper

Extracting randomness using few independent sourcesBARAK, Boaz; IMPAGLIAZZO, Russell; WIGDERSON, Avi et al.Annual Symposium on Foundations of Computer Science. 2004, pp 384-393, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Stochastic DFS for multiprocessor scheduling of cyclic taskgraphsSANDNES, Frode Eika; SINNEN, Oliver.Lecture notes in computer science. 2004, pp 354-362, issn 0302-9743, isbn 3-540-24013-6, 9 p.Conference Paper

Engineering the LOUDS succinct tree representationDELPRATT, Oneil; RAHMAN, Naila; RAMAN, Rajeev et al.Lecture notes in computer science. 2006, pp 134-145, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Intuitive Algorithms and t-Vertex CoverKNEIS, Joachim; MÖLLE, Daniel; RICHTER, Stefan et al.Lecture notes in computer science. 2006, pp 598-607, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

A distributed and probabilistic concurrent constraint programming languageBORTOLUSSI, Luca; WIKLICKY, Herbert.Lecture notes in computer science. 2005, pp 143-158, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 16 p.Conference Paper

A Generalization of the Chow-Liu Algorithm and its Application to Artificial IntelligenceSUZUKI, Joe.Artificial intelligence. International conferenceWorldComp'2010. 2010, pp 478-484, isbn 1-60132-146-5 1-60132-147-3 1-60132-148-1, 7 p.Conference Paper

Competitive analysis of flash-memory algorithmsBEN-AROYA, Avraham; TOLEDO, Sivan.Lecture notes in computer science. 2006, pp 100-111, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Efficient Distributed Weighted Matchings on TreesHOEPMAN, Jaap-Henk; KUTTEN, Shay; LOTKER, Zvi et al.Lecture notes in computer science. 2006, pp 115-129, issn 0302-9743, isbn 3-540-35474-3, 1Vol, 15 p.Conference Paper

Violator spaces : Structure and algorithmsGÄRTNER, Bernd; MATOUSEK, Jiri; RÜST, Leo et al.Lecture notes in computer science. 2006, pp 387-398, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Packet routing and information gathering in lines, rings and treesAZAR, Yossi; ZACHUT, Rafi.Lecture notes in computer science. 2005, pp 484-495, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Simultaneous optimization for concave costs : Single sink aggregation or single source buy-at-bulkGOEL, Ashish; ESTRIN, Deborah.Algorithmica. 2005, Vol 43, Num 1-2, pp 5-15, issn 0178-4617, 11 p.Article